The relation "is subset of" on the power set $P(A)$ of a set $A$ is
Symmetric
Anti-symmetric
Equivalency relation
None of these
If $R$ is an equivalence relation on a Set $A$, then $R^{-1}$ is not :-
Let $R$ be a relation from $A = \{2,3,4,5\}$ to $B = \{3,6,7,10\}$ defined by $R = \{(a,b) |$ $a$ divides $b, a \in A, b \in B\}$, then number of elements in $R^{-1}$ will be-
Let $N$ be the set of natural numbers and a relation $R$ on $N$ be defined by $R=\left\{(x, y) \in N \times N: x^{3}-3 x^{2} y-x y^{2}+3 y^{3}=0\right\} .$ Then the relation $R$ is:
Let $A=\{1,2,3\} .$ Then number of relations containing $(1,2)$ and $(1,3)$ which are reflexive and symmetric but not transitive is
Let ${R_1}$ be a relation defined by ${R_1} = \{ (a,\,b)|a \ge b,\,a,\,b \in R\} $. Then ${R_1}$ is